Partial shape matching using genetic algorithms
نویسندگان
چکیده
منابع مشابه
Partial shape matching using genetic algorithms
Shape recognition is a challenging task when images contain overlapping, noisy, occluded, partial shapes. This paper addresses the task of matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars. We apply genetic algorithms to the partial shape-matching task....
متن کاملPartial Shape Matching Using Transformation Parameter Similarity
In this paper, we present a method for non-rigid, partial shape matching in vector graphics. Given a user-specified query region in a 2D shape, similar regions are found, even if they are non-linearly distorted. Furthermore, a non-linear mapping is established between the query regions and these matches, which allows the automatic transfer of editing operations such as texturing. This is achiev...
متن کاملFast Bayesian Shape Matching Using Geometric Algorithms
We present a Bayesian approach to comparison of geometric shapes with applications to classification of the molecular structures of proteins. Our approach involves the use of distributions defined on transformation invariant shape spaces and the specification of prior distributions on bipartite matchings. Here we emphasize the computational aspects of posterior inference arising from such model...
متن کاملFully Spectral Partial Shape Matching
We propose an efficient procedure for calculating partial dense intrinsic correspondence between deformable shapes performed entirely in the spectral domain. Our technique relies on the recently introduced partial functional maps formalism and on the joint approximate diagonalization (JAD) of the Laplace-Beltrami operators previously introduced for matching non-isometric shapes. We show that a ...
متن کاملPartial 3D Shape Matching Using Large Fat Tetrahedrons
We present a method of automatic alignment of two partially matching 3D shapes. The algorithm selects large fat tetrahedrons (LFT) composed of 4 vertices in one shape and exhaustively searches in the other shape for sets of 4 vertices being compatible with the tetrahedron. By selecting such salient tetrahedrons that are relatively wide and fat, although also being not too unlikely to be contain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 1997
ISSN: 0167-8655
DOI: 10.1016/s0167-8655(97)00123-2